Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Identifieur interne : 00DE14 ( Main/Exploration ); précédent : 00DE13; suivant : 00DE15Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Auteurs : Dieter Hofbauer [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: It is shown that a termination proof for a term rewriting system using multiset path orderings (i.e. recursive path orderings with multiset status only) yields a primitive recursive bound on the length of derivations, measured in the size of the starting term, confirming a conjecture of Plaisted [Pla78]. This result holds for a great variety of path orderings including path of subterms ordering, recursive decomposition ordering, and the path ordering of Kapur, Narendran, Sivakumar if lexicographic status is not incorporated. The result is essentially optimal as such derivation lengths can be found in each level of the Grzegorczyk hierarchy, even for string rewriting systems.
Url:
DOI: 10.1007/3-540-53162-9_50
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001723
- to stream Istex, to step Curation: 001704
- to stream Istex, to step Checkpoint: 003220
- to stream Main, to step Merge: 00E694
- to stream Main, to step Curation: 00DE14
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Termination proofs by multiset path orderings imply primitive recursive derivation lengths</title><author><name sortKey="Hofbauer, Dieter" sort="Hofbauer, Dieter" uniqKey="Hofbauer D" first="Dieter" last="Hofbauer">Dieter Hofbauer</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:63B4CF2F30637F109A5E3B559433BCA54E062F53</idno><date when="1990" year="1990">1990</date><idno type="doi">10.1007/3-540-53162-9_50</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-J6BRLZ89-R/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001723</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001723</idno><idno type="wicri:Area/Istex/Curation">001704</idno><idno type="wicri:Area/Istex/Checkpoint">003220</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003220</idno><idno type="wicri:doubleKey">0302-9743:1990:Hofbauer D:termination:proofs:by</idno><idno type="wicri:Area/Main/Merge">00E694</idno><idno type="wicri:Area/Main/Curation">00DE14</idno><idno type="wicri:Area/Main/Exploration">00DE14</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Termination proofs by multiset path orderings imply primitive recursive derivation lengths</title><author><name sortKey="Hofbauer, Dieter" sort="Hofbauer, Dieter" uniqKey="Hofbauer D" first="Dieter" last="Hofbauer">Dieter Hofbauer</name><affiliation wicri:level="4"><orgName type="university">Université technique de Berlin</orgName><country>Allemagne</country><placeName><settlement type="city">Berlin</settlement><region type="capital">Berlin</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: It is shown that a termination proof for a term rewriting system using multiset path orderings (i.e. recursive path orderings with multiset status only) yields a primitive recursive bound on the length of derivations, measured in the size of the starting term, confirming a conjecture of Plaisted [Pla78]. This result holds for a great variety of path orderings including path of subterms ordering, recursive decomposition ordering, and the path ordering of Kapur, Narendran, Sivakumar if lexicographic status is not incorporated. The result is essentially optimal as such derivation lengths can be found in each level of the Grzegorczyk hierarchy, even for string rewriting systems.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Berlin</li></region><settlement><li>Berlin</li></settlement><orgName><li>Université technique de Berlin</li></orgName></list><tree><country name="Allemagne"><region name="Berlin"><name sortKey="Hofbauer, Dieter" sort="Hofbauer, Dieter" uniqKey="Hofbauer D" first="Dieter" last="Hofbauer">Dieter Hofbauer</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00DE14 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00DE14 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:63B4CF2F30637F109A5E3B559433BCA54E062F53
|texte= Termination proofs by multiset path orderings imply primitive recursive derivation lengths
}}
| This area was generated with Dilib version V0.6.33. |  |